Selective Unification in (Constraint) Logic Programming*

Constraint Hierarchies in Constraint Logic Programming Languages

Houria is an incremental solver that proposes a new implementation of constraint hierarchies. Houria uses local propagation to maintain sets of required and preferential constraints. It represents constraints between variables by sets of short procedures (methods) and incrementally re-satis es the set of constraints when individual constraints are added and removed. The criteria of comparison u...

Constraint Logic Programming

Interval Constraint Logic Programming

In this paper, we present a n o verview on the use of interval arithmetic to process numerical constraints in Constraint Logic Programming. The main principle is to approximate n-ary relations over R I with Cartesian products of intervals whose bounds are taken in a nite subset of R I. V ariables represent real values whose domains are intervals deened in the same manner. Narrowing operators ar...

Coinductive Constraint Logic Programming

Constraint logic programming (CLP) has been proposed as a declarative paradigm for merging constraint solving and logic programming. Recently, coinductive logic programming has been proposed as a powerful extension of logic programming for handling (rational) infinite objects and reasoning about their properties. Coinductive logic programming does not include constraints while CLP’s declarative...

Constraint Logic Programming

Abs t rac t . Constraint Logic Programming (CLP) is a new class of programming languages combining the declarativity of logic programming with the efficiency of constraint solving. New application areas, amongst them many different classes of combinatorial search problems such as scheduhng, planning or resource allocation can now be solved, which were intractable for logic programming so far. T...